TSTP Solution File: CSR151^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR151^3 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:43 EDT 2024
% Result : Theorem 3.94s 3.64s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 80 ( 0 equ; 0 cnn)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 211 ( 30 ~; 26 |; 15 &; 140 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_178,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_1234,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_1451,type,
lBill_THFTYPE_i: $i ).
thf(decl_1452,type,
lMary_THFTYPE_i: $i ).
thf(decl_1453,type,
lSue_THFTYPE_i: $i ).
thf(decl_1454,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_1455,type,
n2009_THFTYPE_i: $i ).
thf(ax,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZXDh1izwXu/E---3.1_9405.p',ax) ).
thf(con,conjecture,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZXDh1izwXu/E---3.1_9405.p',con) ).
thf(c_0_2,axiom,
( ( ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax]) ).
thf(c_0_3,negated_conjecture,
~ ( ( ~ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_4,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_5,negated_conjecture,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_6,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_12,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
thf(c_0_13,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_15,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9]),c_0_13])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.52/1.56 % Problem : CSR151^3 : TPTP v8.1.2. Released v5.3.0.
% 1.52/1.57 % Command : run_E %s %d THM
% 1.59/1.78 % Computer : n009.cluster.edu
% 1.59/1.78 % Model : x86_64 x86_64
% 1.59/1.78 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.59/1.78 % Memory : 8042.1875MB
% 1.59/1.78 % OS : Linux 3.10.0-693.el7.x86_64
% 1.59/1.78 % CPULimit : 300
% 1.59/1.78 % WCLimit : 300
% 1.59/1.78 % DateTime : Fri May 3 14:21:24 EDT 2024
% 1.59/1.78 % CPUTime :
% 3.15/3.34 Running higher-order theorem proving
% 3.15/3.34 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ZXDh1izwXu/E---3.1_9405.p
% 3.94/3.64 # Version: 3.1.0-ho
% 3.94/3.64 # Preprocessing class: HMLLSMSLSSMCHFA.
% 3.94/3.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.94/3.64 # Starting new_ho_10 with 1500s (5) cores
% 3.94/3.64 # Starting sh5l with 300s (1) cores
% 3.94/3.64 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 3.94/3.64 # Starting lpo1_def_fix with 300s (1) cores
% 3.94/3.64 # ehoh_best_sine_rwall with pid 9491 completed with status 0
% 3.94/3.64 # Result found by ehoh_best_sine_rwall
% 3.94/3.64 # Preprocessing class: HMLLSMSLSSMCHFA.
% 3.94/3.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.94/3.64 # Starting new_ho_10 with 1500s (5) cores
% 3.94/3.64 # Starting sh5l with 300s (1) cores
% 3.94/3.64 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 3.94/3.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.94/3.64 # Search class: HGHSM-SMLM31-MHFFFFBN
% 3.94/3.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.94/3.64 # Starting sh3 with 163s (1) cores
% 3.94/3.64 # sh3 with pid 9493 completed with status 0
% 3.94/3.64 # Result found by sh3
% 3.94/3.64 # Preprocessing class: HMLLSMSLSSMCHFA.
% 3.94/3.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.94/3.64 # Starting new_ho_10 with 1500s (5) cores
% 3.94/3.64 # Starting sh5l with 300s (1) cores
% 3.94/3.64 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 3.94/3.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.94/3.64 # Search class: HGHSM-SMLM31-MHFFFFBN
% 3.94/3.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.94/3.64 # Starting sh3 with 163s (1) cores
% 3.94/3.64 # Preprocessing time : 0.033 s
% 3.94/3.64 # Presaturation interreduction done
% 3.94/3.64
% 3.94/3.64 # Proof found!
% 3.94/3.64 # SZS status Theorem
% 3.94/3.64 # SZS output start CNFRefutation
% See solution above
% 3.94/3.64 # Parsed axioms : 5014
% 3.94/3.64 # Removed by relevancy pruning/SinE : 3073
% 3.94/3.64 # Initial clauses : 2829
% 3.94/3.64 # Removed in clause preprocessing : 181
% 3.94/3.64 # Initial clauses in saturation : 2648
% 3.94/3.64 # Processed clauses : 24
% 3.94/3.64 # ...of these trivial : 0
% 3.94/3.64 # ...subsumed : 1
% 3.94/3.64 # ...remaining for further processing : 22
% 3.94/3.64 # Other redundant clauses eliminated : 1
% 3.94/3.64 # Clauses deleted for lack of memory : 0
% 3.94/3.64 # Backward-subsumed : 3
% 3.94/3.64 # Backward-rewritten : 2
% 3.94/3.64 # Generated clauses : 1
% 3.94/3.64 # ...of the previous two non-redundant : 3
% 3.94/3.64 # ...aggressively subsumed : 0
% 3.94/3.64 # Contextual simplify-reflections : 2
% 3.94/3.65 # Paramodulations : 0
% 3.94/3.65 # Factorizations : 0
% 3.94/3.65 # NegExts : 0
% 3.94/3.65 # Equation resolutions : 1
% 3.94/3.65 # Disequality decompositions : 0
% 3.94/3.65 # Total rewrite steps : 4
% 3.94/3.65 # ...of those cached : 2
% 3.94/3.65 # Propositional unsat checks : 0
% 3.94/3.65 # Propositional check models : 0
% 3.94/3.65 # Propositional check unsatisfiable : 0
% 3.94/3.65 # Propositional clauses : 0
% 3.94/3.65 # Propositional clauses after purity: 0
% 3.94/3.65 # Propositional unsat core size : 0
% 3.94/3.65 # Propositional preprocessing time : 0.000
% 3.94/3.65 # Propositional encoding time : 0.000
% 3.94/3.65 # Propositional solver time : 0.000
% 3.94/3.65 # Success case prop preproc time : 0.000
% 3.94/3.65 # Success case prop encoding time : 0.000
% 3.94/3.65 # Success case prop solver time : 0.000
% 3.94/3.65 # Current number of processed clauses : 16
% 3.94/3.65 # Positive orientable unit clauses : 9
% 3.94/3.65 # Positive unorientable unit clauses: 0
% 3.94/3.65 # Negative unit clauses : 2
% 3.94/3.65 # Non-unit-clauses : 5
% 3.94/3.65 # Current number of unprocessed clauses: 2627
% 3.94/3.65 # ...number of literals in the above : 5792
% 3.94/3.65 # Current number of archived formulas : 0
% 3.94/3.65 # Current number of archived clauses : 5
% 3.94/3.65 # Clause-clause subsumption calls (NU) : 23
% 3.94/3.65 # Rec. Clause-clause subsumption calls : 21
% 3.94/3.65 # Non-unit clause-clause subsumptions : 3
% 3.94/3.65 # Unit Clause-clause subsumption calls : 4
% 3.94/3.65 # Rewrite failures with RHS unbound : 0
% 3.94/3.65 # BW rewrite match attempts : 2
% 3.94/3.65 # BW rewrite match successes : 2
% 3.94/3.65 # Condensation attempts : 0
% 3.94/3.65 # Condensation successes : 0
% 3.94/3.65 # Termbank termtop insertions : 160761
% 3.94/3.65 # Search garbage collected termcells : 36261
% 3.94/3.65
% 3.94/3.65 # -------------------------------------------------
% 3.94/3.65 # User time : 0.185 s
% 3.94/3.65 # System time : 0.016 s
% 3.94/3.65 # Total time : 0.201 s
% 3.94/3.65 # Maximum resident set size: 13636 pages
% 3.94/3.65
% 3.94/3.65 # -------------------------------------------------
% 3.94/3.65 # User time : 0.275 s
% 3.94/3.65 # System time : 0.024 s
% 3.94/3.65 # Total time : 0.298 s
% 3.94/3.65 # Maximum resident set size: 5872 pages
% 3.94/3.65 % E---3.1 exiting
% 3.94/3.65 % E exiting
%------------------------------------------------------------------------------